Epsilon Approximate Solutions for Multiobjective Programming Problems
نویسندگان
چکیده
منابع مشابه
Generating epsilon-efficient solutions in multiobjective programming
Scalarization approaches to purposely generating epsilon-efficient solutions of multiobjective programs are investigated and a generic procedure for computing these solutions is proposed and illustrated with an example. Real-life decision making situations in which the solutions are of significance are described.
متن کاملOptimality Conditions for Approximate Solutions in Multiobjective Optimization Problems
We study firstand second-order necessary and sufficient optimality conditions for approximate weakly, properly efficient solutions of multiobjective optimization problems. Here, tangent cone, -normal cone, cones of feasible directions, second-order tangent set, asymptotic second-order cone, and Hadamard upper lower directional derivatives are used in the characterizations. The results are first...
متن کاملNew optimality conditions for multiobjective fuzzy programming problems
In this paper we study fuzzy multiobjective optimization problems defined for $n$ variables. Based on a new $p$-dimensional fuzzy stationary-point definition, necessary efficiency conditions are obtained. And we prove that these conditions are also sufficient under new fuzzy generalized convexity notions. Furthermore, the results are obtained under general differentiability hypothesis.
متن کاملSolving multiobjective linear programming problems using ball center of polytopes
Here, we aim to develop a new algorithm for solving a multiobjective linear programming problem. The algorithm is to obtain a solution which approximately meets the decision maker's preferences. It is proved that the proposed algorithm always converges to a weak efficient solution and at times converges to an efficient solution. Numerical examples and a simulation study are used to illu...
متن کاملStochastic approach versus multiobjective approach for obtaining efficient solutions in stochastic multiobjective programming problems
In this work, we deal with obtaining efficient solutions for stochastic multiobjective programming problems. In general, these solutions are obtained in two stages: in one of them, the stochastic problem is transformed into its equivalent deterministic problem, and in the other one, some of the existing generating techniques in multiobjective programming are applied to obtain efficient solution...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1996
ISSN: 0022-247X
DOI: 10.1006/jmaa.1996.0371